Neighborhood Interchangeability and Dynamic Bundling for Non-Binary Finite CSPs
نویسندگان
چکیده
Neighborhood Interchangeability (NI) identifies the equivalent values in the domain of a variable of a Constraint Satisfaction Problem (CSP) by considering only the constraints that directly apply to the variable. Freuder described an algorithm for efficiently computing NI values in binary CSPs. In this paper, we show that the generalization of this algorithm to non-binary CSPs is not straightforward, and introduce an efficient algorithm for computing NI values in the presence of non-binary constraints. Further, we show how to interleave this mechanism with search for solving CSPs, thus yielding a dynamic bundling strategy. While the goal of dynamic bundling is to produce multiple robust solutions, we empirically show that it does not increase (but significantly decreases) the cost of search.
منابع مشابه
How the Level of Interchangeability Embedded in a Finite Constraint Satisfaction Problem Affects the Performance of Search
We investigate how the performance of search for solving finite constraint satisfaction problems (CSPs) is affected by the level of interchangeability embedded in the problem. First, we describe a generator of random CSPs that allows us to control the level of interchangeability in an instance. Then we study how the varying level of interchangeability affects the performance of search for findi...
متن کاملContext in Discrete Constraint Satisfaction Problems
In this paper, we study interchangeability in finite and discrete constraint satisfaction problems (CSPs). In many applications modeled as CSPs, it is important to be able to build on the spot equivalence classes of objects of the world to allow local modifications of the solutions and highlight opportunities for change. The concept of interchangeability, defined by Freuder [4], formalizes equi...
متن کاملExperimental Evaluation of Interchangeability in Soft CSPs
In [8], Freuder defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently [2], we extended the definition of interchangeability to Soft CSPs and we introduced two notions of relaxation based on degradation δ and on threshold α (neighborhood interchangeability (NI )and α neighborhood interchangeability (αNI )). In this paper we extend the study introduced in [11]...
متن کاملOn the Computation of Local Interchangeability in Soft Constraint Satisfaction Problems
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSPs and we introduced two notions of relaxations based on degradation δ and on threshold α (neighborhood interchangeability (αNI )and αneighborhood interchangeability NI ). In this paper we study the presence of these rela...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005